Nonstandard runs of Floyd-provable programs

نویسنده

  • István Németi
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Compositional Logic for Protocol Correctness

We present a specialized protocol logic that is built around a process language for describing the actions of a protocol. In general terms, the relation between logic and protocol is like the relation between assertions in Floyd-Hoare logic and standard imperative programs. Like Floyd-Hoare logic, our logic contains axioms and inference rules for each of the main protocol actions and proofs are...

متن کامل

Completeness of Hoare Logic over Nonstandard Models

The nonstandard approach to program semantics has successfully resolved the completeness problem of Floyd-Hoare logic. The known versions of nonstandard semantics, the Hungary semantics and axiomatic semantics, are so general that they are absent either from mathematical elegance or from practical usefulness. The aim of this paper is to exhibit a not only mathematically elegant but also practic...

متن کامل

An Elementary Proof for Some Semantic Characterizations of Nondeterministic Floyd-Hoare Logic

We give a relatively simple and direct proof for Csirmaz's characterization of Floyd-Hoare logic for nondeterministic programs [5]. (This also yields a very simple proof for Leivant's characterization [13].) We also establish a direct connection between "relational traces" and "time-models" for nondeterministic programs. Introduction In this paper we investigate semantic characterizations of th...

متن کامل

Weak Second Order Characterizations of Various Program Verification Systems

We show the equivalence (!{ LeivIIlII' .1' dUlfl/r;wr;zmion of Floyd-Hoare Logic in weak second order logic (fLeSSJ) with both Csirltl(lZ'S (f Cs80I) 111/(/ Selin's (f Sa85bJ) characterizations of Floyd-Hoare logic in Nonstandard Logics of Programs, Ow method allows us u) spell out tlJ.e precise role of the comprehension axiom in weak second order [og;I:. Ii .(~ then prove similar resultsIor ot...

متن کامل

English to Indian Languages Machine Transliteration System at NEWS 2010

This paper reports about our work in the NEWS 2010 Shared Task on Transliteration Generation held as part of ACL 2010. One standard run and two non-standard runs were submitted for English to Hindi and Bengali transliteration while one standard and one nonstandard run were submitted for Kannada and Tamil. The transliteration systems are based on Orthographic rules and Phoneme based technology. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1980